The late acceptance Hill-Climbing heuristic
نویسندگان
چکیده
منابع مشابه
The late acceptance Hill-Climbing heuristic
This paper introduces a new and very simple search methodology called Late Acceptance Hill-Climbing (LAHC). It is a one-point iterative search algorithm, which accepts non-improving moves when a candidate cost function is better (or equal) than it was a number of iterations before. This value appears as a single algorithmic input parameter which determines the total processing time of the searc...
متن کاملLate Acceptance Hill Climbing for The Liner Shipping Fleet Repositioning Problem
Late Acceptance Hill Climbing (LAHC) has been shown to be an effective local search method for several types of optimization problems, such as on certain types of scheduling problems as well as the traveling salesman problem. We apply LAHC to a central problem in the liner shipping industry, the Liner Shipping Fleet Repositioning Problem (LSFRP). The LSFRP involves the movement of vessels betwe...
متن کاملAssociation Rule Mining Based Video Classifier with Late Acceptance Hill Climbing Approach
Video classification is an essential step towards video perceptive. In recent years, the concept of utilizing association rules for classification emerged. This approach is more efficient and accurate than traditional techniques. Associative classifier integrates two data mining tasks such as association rule discovery and classification, to build a classifier for the purpose of prediction. The...
متن کاملA Late Acceptance Strategy in Hill-Climbing for Exam Timetabling Problems
Over the years, many variants, extensions and adaptations of local search techniques have appeared in the literature. Some of them have become extremely famous, such as Simulated Annealing. Other ones have almost been forgotten, for example, “Record-toRecord Travelling” (Dueck 1993) or the “Old Bachelor Acceptance Algorithm” (Hu et al. 1995). In this abstract, we are proposing another new local...
متن کاملProbabilistic Hill-climbing
Many learning tasks involve searching through a discrete space of performance elements, seeking an element whose future utility is expected to be high. As the task of nding the global optimum is often intractable, many practical learning systems use simple forms of hill-climbing to nd a locally optimal element. However, hill-climbing can be complicated by the fact that the utility value of a pe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2017
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2016.07.012